Irrationality of Roots of Non Squares

This note deals with the standard techniques for proving the following fact.

Theorem

The square root of any positive integer which is not a square is irrational.


We first prove a special case.

Lemma

The square root of any squarefree integer greater than 1 is irrational.

Proof

Let d be squarefree. We prove that d is irrational by contradiction, that is, we assume it can be written in the form ab where aZ, bZ>0 and gcd(a,b)=1.

d=abd=a2b2db2=a2

Therefore da2, since d is squarefree, we can thus conclude by this result that da. As such, we write a=dc.

db2=(dc)2db2=d2c2b2=dc2

By a similar argument to the above, we now also may conclude that db, and thus gcd(a,b)d>1, a contradiction.


It should be noted that the above proof can be completed without the condition that gcd(a,b)=1 simply by noting that after dividing out a common factor of d from a and b, we are left with the same initial construction and the argument of the proof can repeat. Therefore, we have proven that a and b are both infinitely divisible by d, which is a contradiction since the only integer satisfying this property is 0 and b0.


The above method does not work for examples such as 12, however 12 is irrational. This means a different approach is needed to prove this. We now handle the general case.

Lemma

For a positive integer n=k2 written with the squarefree part taken out, n is irrational if and only if k is irrational.

Proof

Taking the square root of either side of the squarefree factorisation of n we get n=k. Then, given that is rational, and the product of a non-zero rational number with an irrational number is irrational, we can conclude that n is rational if and only if n is.


The main result then follows as a direct consequence.

Proof

For any integer n=k2 written as above, the only case in which the squareroot of a squarefree integer k can be rational is if k=1. In this case, n=2 and n is a square. In all other cases, n must be irrational.